Problem:
 a(x1) -> b(x1)
 a(b(b(x1))) -> c(x1)
 c(c(x1)) -> a(b(c(a(x1))))

Proof:
 Bounds Processor:
  bound: 1
  enrichment: match
  automaton:
   final states: {3,2}
   transitions:
    c1(8) -> 9*
    b1(6) -> 7*
    a0(1) -> 2*
    b0(1) -> 1*
    c0(1) -> 3*
    1 -> 8,6
    7 -> 2*
    9 -> 2*
  problem:
   
  Qed